recursive type造句

例句与造句

1. The two forms differ in how terms of a recursive type are introduced and eliminated.
2. There are two forms of recursive types : the so-called isorecursive types, and equirecursive types.
3. In programming languages that support recursive types, it is possible to type the Y combinator by appropriately accounting for the recursion at the type level.
4. Some birds, like the galah, or rose-breasted cockatoo, have modified crests, which has features of both recumbent and recursive types.
5. If a datatype is recursive, the entire sum of products is wrapped in a recursive type, and each constructor also rolls the datatype into the recursive type.
6. It's difficult to find recursive type in a sentence. 用recursive type造句挺难的
7. If a datatype is recursive, the entire sum of products is wrapped in a recursive type, and each constructor also rolls the datatype into the recursive type.
8. In the simply typed lambda calculus extended with recursive types, fixed-point operators can be written, but the type of a " useful " fixed-point operator ( one whose application always returns ) may be restricted.
9. Recursion can be added to the language by either having a special operator \ mathtt { fix } _ \ alpha of type ( \ alpha \ to \ alpha ) \ to \ alpha or adding general recursive types, though both eliminate strong normalization.
10. A forward slash denotes that the argument should appear to the right, while a backslash denotes that the argument should appear on the left . Any type can stand in for the " X " and " Y " here, making syntactic types in CCG a recursive type system.
11. For the purposes of the List example, these two formulations are not significantly different; but the second form allows expressing so-called nested data types, i . e ., those where the recursive type differs parametrically from the original . ( For more information on nested data types, see the works of Richard Bird, Lambert Meertens, and Ross Paterson .)
12. This is because type synonyms, like typedefs in C, are replaced with their definition at compile time . ( Type synonyms are not " real " types; they are just " aliases " for convenience of the programmer . ) But if you try to do this with a recursive type, it will loop infinitely because no matter how many times you substitute it, it still refers to itself, e . g . " Bad " will grow indefinitely : ( Int, ( Int, ( Int, . . ..